On a bicriterion server allocation problem in a multidimensional Erlang loss system
نویسندگان
چکیده
منابع مشابه
Task Allocation in a Multi-Server System
We consider a slotted queueing system with C servers (processors) that can handle tasks (jobs). Tasks arrive in batches of random size at the start of every slot. Any task can be executed by any server in one slot with success probability α. If a task execution fails, then the task must be handled in some later time slot until it has been completed successfully. Tasks may be processed by severa...
متن کاملRedundancy Allocation Problem of a System with Three-state Components: A Genetic Algorithm (RESEARCH NOTE)
The redundancy allocation is one of the most important and useful problems in system optimization, especially in electrical and mechanical systems. The object of this problem is to maximize system reliability or availability within a minimum operation cost. Many works have been proposed in this area so far to draw the problem near to real-world situations. While in classic models the system com...
متن کاملOn the Bicriterion Multi Modal Assignment Problem
We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points or an approximation. Extensive computational results are conducted on a large library of test instances to test the ...
متن کاملa study on rate making and required reserves determination in reinsurance market: a simulation
reinsurance is widely recognized as an important instrument in the capital management of an insurance company as well as its risk management tool. this thesis is intended to determine premium rates for different types of reinsurance policies. also, given the fact that the reinsurance coverage of every company depends upon its reserves, so different types of reserves and the method of their calc...
A simple algebraic approximation to the Erlang loss system
We use Palm calculus to derive a simple, intuitive system of two linear-quadratic equations and two unknowns, whose algebraic solution yields Harel’s (1988) upper bound to the Erlang loss probability. We then derive a sequence of progressively stronger systems of equations, which eventually become exact. We provide two example applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2013
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.03.012